Randomizing Dispatch Scheduling Policies
نویسندگان
چکیده
The factory is a complex dynamic environment and scheduling operations for such an environment is a challenging problem. In practice, dispatch scheduling policies are commonly employed, as they offer an efficient and robust solution. However, dispatch scheduling policies are generally myopic, and as such they are susceptible to sub-optimal decision-making. In this paper, we attempt to improve upon results of such dispatch policies by introducing non-determinism into the decision-making process, and instead using a given policy as a baseline for biasing stochastic decisions. We consider the problem of weighted tardiness scheduling with sequencedependent setups with unknown arrival times in a dynamic environment, and show that randomization of state-of-the-art dispatch heuristics for this problem in this manner can improve performance. Furthermore, we find that the “easier” the problem, the less benefit there is from randomization; the “harder” the problem, the more benefit. Our method of randomization is based on a model of the way colonies of wasps self-organize social hierarchies in nature.
منابع مشابه
Heuristic Sequencing Crossover: Integrating Problem Dependent Heuristic Knowledge into a Genetic Algorithm
Dispatch scheduling policies offer a computationally inexpensive approach to many scheduling problems as an alternative to more processor intensive search algorithms. They are especially useful in dynamic situations where problem solving may be temporally constrained. However, dispatch heuristics have also been effectively used for guidance within more intensive search algorithms, expanding the...
متن کاملStochastic Optimization and Real-Time Scheduling in Cyber-Physical Systems
A principal goal of this dissertation is to study stochastic optimization and real-time scheduling in cyber-physical systems (CPSs) ranging from realtime wireless systems to energy systems to distributed control systems. Under this common theme, this dissertation can be broadly organized into three parts based on the system environments. The first part investigates stochastic optimization in re...
متن کاملFalkon: A Proposal for Project Globus Incubation
Many interesting computations can be expressed conveniently as data-driven task graphs, in which individual tasks wait for input to be available, perform computation, and produce output. Systems such as DAGMan, Karajan [7, 8], Swift [7, 8], and VDS support this model. These systems have all been used to encode and execute thousands of individual tasks. However, dispatching such tasks directly t...
متن کاملSensor-Driven Condition-Based Generator Maintenance Scheduling Part 1: Maintenance Problem
Traditionally, generator maintenance scheduling has been implemented using highly conservative maintenance policies based on manufacturing specifications and engineering expertise on the type of generators. However, recent advances in sensor technology, signal processing, and embedded online diagnosis provide more unit-specific information on the degradation characteristics of the generators. I...
متن کاملAn Enhanced Security-Constrained Unit Commitment Model with Reserve Response Set Policies
Security-constrained unit commitment (SCUC) is a classical problem used for day-ahead commitment, dispatch, and reserve scheduling. Even though SCUC models acquire reserves, N-1 reliability is not guaranteed. This paper presents an enhanced securityconstrained unit commitment formulation that facilitates the integration of stochastic resources and accounts for reserve deliverability issues. In ...
متن کامل